A deterministic algorithm for the three-dimensional diameter problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Eecient Algorithm for the Three-dimensional Diameter Problem
We give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n log 2 n) running time. This bound matches the best previous algorithm of Ramos 18]. However, our algorithm applies another technique and is simpler.
متن کاملA Fast Algorithm for Three-Dimensional Layers of Maxima Problem
We show that the three-dimensional layers-of-maxima problem can be solved in o(n log n) time in the word RAM model. Our algorithm runs in O(n(log log n)) deterministic time or O(n(log log n)) expected time and uses O(n) space. We also describe a deterministic algorithm that uses optimal O(n) space and solves the three-dimensional layers-of-maxima problem in O(n log n) time in the pointer machine
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملA Distributed Algorithm for the Minimum Diameter Spanning Tree Problem
We present a new algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of any arbitrary positively real-weighted graph. We use a new fast linear time intermediate all-pairs shortest paths routing protocol. The resulting distributed algorithm is asynchronous, it works for arbitrary named network, and achieves O(n) time complexity and O(nm) message complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1996
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00025-9